207. [X. 4.]. “Graphs”
نویسندگان
چکیده
منابع مشابه
Biodrugs 2006; 20 (4): 201-207
Purpose: To evaluate whether Zr can be used as a PET surrogate label for quantification of Yibritumomab tiuxetan (Y-Zevalin) biodistribution and dosimetry before myeloablative radioimmunotherapy. Methods: Zevalin was labelled with Zr by introducing Nsuccinyldesferal (N-sucDf) as a second chelate. For comparison of the in vitro stability of Zr-Zevalin and Y-Zevalin (as a substitute for Y), sampl...
متن کاملPns1300002 207..218
Technologic advances now make it possible to collect large amounts of genetic, epigenetic, metabolomic and gut microbiome data. These data have the potential to transform approaches towards nutrition counselling by allowing us to recognise and embrace the metabolic, physiologic and genetic differences among individuals. The ultimate goal is to be able to integrate these multi-dimensional data s...
متن کاملDev113043 207..217
In many invertebrates, the nuclearization of β-catenin at one pole of the embryo initiates endomesoderm specification. An intriguing possibility is that a gradient of nuclear β-catenin (nβ-catenin), similar to that operating in vertebrate neural tube patterning, functions to distinguish cell fates in invertebrates. To test this hypothesis, we determined the function of nβ-catenin during the ear...
متن کاملTf-cmte130322 201..207
Background: Clinical supervision has gained wide recognition in recent years as an essential component of a practitioner’s continuing professional development. However, confusion exists in professional literature regarding the most effective models, styles, processes and methods of clinical supervision. Aim: This article outlines the elements required to establish and sustain an effective clini...
متن کامل4-prime Cordial Graphs Obtained from 4-prime Cordial Graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a function. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if ∣∣vf (i)− vf (j)∣∣ 6 1, i, j ∈ {1, 2, . . . , k} and ∣∣ef (0)− ef (1)∣∣ 6 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematical Gazette
سال: 1906
ISSN: 0025-5572,2056-6328
DOI: 10.2307/3603723